Graph-based ontology reasoning for formal verification of BREEAM rules
نویسندگان
چکیده
منابع مشابه
?Logic and Formal Ontology: Is the Final Formal Ontology Possible
Musa Akrami AbstractMany philosophers and logicians have contemplated the relationship between ontology and logic. The author of this paper, working within a Bolzanoan-Husserlian tradition of studying both ontology and logic, considers ontology as the science of the most general features of beings and the most general relations among them. He considers logic as the science concernin...
متن کاملGraph-based Rules for XML Data Conversion to OWL Ontology
The paper presents a flexible method to enrich and populate an existing OWL ontology from XML data based on graph-based rules. These rules are defined in order to populate automatically a new version of an OWL ontology. Today, most of data exchanged between information systems is done with the help of the XML document. Leading researches in the domain of database systems are moving to semantic ...
متن کاملDesign and formal verification of DZMBE+
In this paper, a new broadcast encryption scheme is presented based on threshold secret sharing and secure multiparty computation. This scheme is maintained to be dynamic in that a broadcaster can broadcast a message to any of the dynamic groups of users in the system and it is also fair in the sense that no cheater is able to gain an unfair advantage over other users. Another important feature...
متن کاملAutomated Reasoning for Software Engineering (F24AI1) Modelling & Formal Verification Assignment
Safety should be the primary concern when building a railway network. The safety of a railway network typically depends upon the use of track-side signals in regulating the safe passage of trains. Establishing the correctness of the systems that control the track-side signals therefore plays a crucial role in ensuring the safety of the railway network. The aim of the assignment is to develop a ...
متن کاملConfluent Term-Graph Reduction for Computer-Aided Formal Reasoning
Sparkle is the dedicated proof assistant for the lazy functional programming language Clean, which is based on term-graph rewriting. Because equational reasoning is an important proof technique, Sparkle needs to offer support for formally proving e1 = e2 in as many situations as possible. The base proof of equality is by means of reduction: if e1 reduces to e2, then also e1 = e2. Therefore, the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Cognitive Systems Research
سال: 2019
ISSN: 1389-0417
DOI: 10.1016/j.cogsys.2018.12.011